Expanding an Extended Finite State Machine to aid Testability
نویسندگان
چکیده
The problem of testing from an extended finite state machine (EFSM) is complicated by the presence of infeasible paths. This paper considers the problem of expanding an EFSM in order to bypass the infeasible path problem. The approach is developed for the specification language SDL but, in order to aid generality, the rewriting process is broken down into two phases: producing a normal form EFSM (NF-EFSM) from an SDL specification and then expanding this NF-EFSM. keywords: extended finite state machine, testability, infeasible paths.
منابع مشابه
On the testability of SDL specifications
The problem of testing from an SDL specification is often complicated by the presence of infeasible paths. This paper introduces an approach for transforming a class of SDL specification in order to eliminate or reduce the infeasible path problem. This approach is divided into two phases in order to aid generality. First the SDL specification is rewritten to create a normal form extended finite...
متن کاملPii: S0950-5849(99)00033-6
To deal with the increased complexity related to the testing of communications software, we propose the integration and application of finite state machine based specification transformations and testability measures early in the communications software development process. Based on this integration, the testability of a given design is estimated and appropriate specification transformations ar...
متن کاملEasily testable PLA-based finite state machines
the area and timing penalty associated with LSSD techniques are not acceptable to designers. In this paper, we outline a synthesis procedure, which Logic synthesis and minimization techniques can, in beginning from a State Transition Graph description principle, ensure fully and easily testable combinational of a sequential machine, produces an optimized easily and sequential circuit designs. I...
متن کاملA synthesis for testability scheme for finite state machines using clock control
A new method is proposed for improving the testability of a finite state machine (FSM) during its synthesis. The method exploits clock control to enhance the controllability and observability of machine states. With clock control it is possible to add new state transitions during testing. Therefore, it is easier to navigate between states in the resulting test machine. Unlike prior work, where ...
متن کاملOn Local Testability in Watson-Crick Finite Automata
Watson-Crick finite automata were first proposed in [2] inspired by formal language theory, finite states machines and some ingredients from DNA computing such as working with molecules as double stranded complementary strings. Here, we define different kinds of local testability in this model. Mainly, we will explore local testability in the upper (lower) strand and in the double strand.
متن کامل